Risk avoidance: graphs versus numbers.
نویسندگان
چکیده
There have long been speculations that graphical and numerical presentations of risk statistics differ in their impact on people's wilingness to pursue actions that could harm or even kill them. But research has been unclear about the processes whereby the pictorial character of graphical displays per se might affect those risky decisions or even whether such effects actually occur. In two studies, we demonstrate that the pictorial nature of a graphical risk display can, indeed, increase risk avoidance. This increase is associated with a heightened impression of the riskiness of less safe alternatives. The results suggest that this picture-driven, intensified sense of riskiness, in turn, rests on two kinds of mechanisms: one cognitive, the other affective. Cognitively, pictorial presentations impose weaker upper bounds on people's internal representations of the chances that riskier alternatives will bring about actual harm. Affectively, pictures ignite stronger, more aversive negative associations with riskier options and their outcomes.
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملRamsey Numbers of K M versus (n; K)-graphs and the Local Density of Graphs Not Containing a K M
In this paper generalized Ramsey numbers of complete graphs K m versus the set h; n; ki of (n; k)-graphs are investigated. The value of r(K m ; hn; ki) is given in general for (relative to n) values of k small compared to n using a correlation with Turr an numbers. These generalized Ramsey numbers can be used to determine the local densities of graphs not containing a subgraph K m .
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Memory & cognition
دوره 34 2 شماره
صفحات -
تاریخ انتشار 2006